package com.job.netease;

import java.util.Arrays;

/**
 * <p>
 *
 * </p>
 *
 * @author 12071
 * @date 2022/8/20 15:00
 */
public class Netease0820 {


    public static void d(String[] args) {
        // 斐波那契变体
        // f(n) = f(n-1)^2 * f(n-2)^2
    }

    public static void c(String[] args) {
        int n =2;
        int[] nums = {1, 2, 3, 4, 5};
        int max = 0;
        int[] maxIndex = new int[2];
        for (int i = 0; i < nums.length-1; i++) {
            for (int j = i+1; j < nums.length; j++) {
                int tmp = (nums[i] & nums[j]);
                if(tmp > max){
                    maxIndex[0] = i;
                    maxIndex[1] = j;
                    max = tmp;
                }
            }
        }
        System.out.println(max + " " + Arrays.toString(maxIndex));
    }


    public static void b(String[] args) {
        // https://blog.csdn.net/sinat_36246371/article/details/53058202

    }


    public static void a(String[] args) {
        int[] nums = {3, 2, 1};

    }
}
